A New Exact Algorithm for Highly Testable Generalized Partially Mixed Polarity Reed Muller Forms
نویسندگان
چکیده
Generalized Partially Mixed Polarity Reed Muller GPMPRM expansions are a canonical sub family of Generalized Reed Muller GRM expansions and super family of Fixed Polarity Reed Muller FPRM expansions The main motivation to study GPM PRM forms is their very high testability similar to FPRM forms and better than GRMs which are also highly testable Since GPMPRM sub family of ESOP is much larger than FPRM expansions the minimal form of this expansion will be much closer to the min imal ESOP than the minimal form of FPRM expan sion with the same order of testability We give an improved algorithm to nd exact GPMPRM forms By comparing the ratio of the number of forms to the number of operations of the algorithm used to compute the minimal forms with that of the existing algorithms we conclude that the algorithm is highly e cient Sim ilar to the expansions based on Kronecker matrix prod ucts this algorithm can be e ciently implemented in hardware using only EXOR operations
منابع مشابه
Generalised k-variable-mixed-polarity Reed-Muller expansions for system of Boolean functions and their minimisation
A lookup table based method to minimise generalised partially-mixed-polarity ReedMuller (GPMPRM) expansions with k mixed polarity variables is presented. The developed algorithm can produce solutions based on the desired cost criteria for the systems of completely specified functions. A heuristic approach based on the exclusion rule is adopted to extract the best dual polarity variables from an...
متن کاملApproximate Minimization Of Generalized Reed Muller Forms
Paper presents a new approach to Gen eralized Reed Muller form minimization The concept of adjacent polarity of forms is introduced that is next used to generate exact and approximate solutions An algorithm to generate a GRM form from any other form is given While adjacent polarities are used for local optimization global minimum is found using the adaptation of Genetic Algorithm approach For t...
متن کاملA Canonical And/exor Form That Includes Both the Generalized Reed-muller Forms and Kronecker Reed-muller Forms
| The paper gives a positive answer to a question posed by Tsutomu Sasao-whether there exists some family of canonical forms that would include both the Generalized Reed-Muller Forms and the Kro-necker RM Forms as its special cases. We call the new forms Generalized Kronecker Forms. We present also the corresponding decision diagrams. They can be used for representation of large functions and a...
متن کاملOnset based optimization of multi-level mixed polarity Reed-Muller functions
A novel onset based optimization method is proposed to convert a Fixed Polarity Reed-Muller (FPRM) function to a compact Multi-level Mixed Polarity Reed-Muller (MMPRM) forms. Onset table is introduced to represent an FPRM function. By operating on the onset table to extract common variables, its compact MMPRM is obtained. The spatial complexity of the proposed algorithm is O(M×n) (M is onset si...
متن کاملA Canonical And/exor Form That Includes Both the Generalized Reed-muller Forms and Kronecker Forms
| The paper gives a positive answer to an open problem-whether there exists some family of canonical forms that would include both the Generalized Reed-Muller Forms and the Kronecker Forms as its special cases. We call the new forms Generalized Kronecker Forms. We present also the corresponding decision diagrams. They can be used for representation of large functions and also for optimal synthe...
متن کامل